Distributed Time-Asynchronous Automata
نویسندگان
چکیده
We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its related class of stopwatch automata.
منابع مشابه
Generalized Asynchronous Systems
The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asyn-chronous automata are introduced here. It is proved that the Petri nets and transition systems with independence can be considered like the distributed asynchronous automata. Time distributed asynchronous automata are defined in standard way by the map which assigns tim...
متن کاملAutomata on Distributed Alphabets
Traditional automata theory is an extremely useful abstraction for reasoning about sequential computing devices. For distributed systems, however, there is no clear consensus on how best to incorporate various features such as spatial independence, concurrency and communication into a formal computational model. One appealing and elegant approach is to have a network of automata operating on a ...
متن کاملOn the Complementation of Asynchronous Cellular Büchi Automata
We present direct subset automata constructions for asynchronous (asyn-chronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of nite traces. We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement non-deterministic asynchronous cellular B uc...
متن کاملSynthesis of Distributed Algorithms Using Asynchronous Automata
We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and characterise the languages they accept. We analyze the complexity of the synthesis problem in our framework. Theorems by Zielonka and Morin are then used to develop and implement a synthesis algorithm. Finally, we apply the developed...
متن کاملOn Distributed Monitoring of Asynchronous Systems
Distributed systems are notoriously difficult to understand and analyze in order to assert their correction w.r.t. given properties. They often exhibit a huge number of different behaviors, as soon as the active entities (peers, agents, processes, etc) behave in an asynchronous manner. Already the modelization of such systems is a non-trivial task, let alone their formal verification. The purpo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007